Effective Back-Patch Culling for Hardware Tessellation

نویسندگان

  • Charles T. Loop
  • Matthias Nießner
  • Christian Eisenacher
چکیده

When rendering objects with hardware tessellation, back-facing patches should be culled as early as possible to avoid unnecessary surface evaluations, and setup costs for the tessellator and rasterizer. For dynamic objects the popular cone-of-normals approach is usually approximated using tangent and bitangent cones. This is faster to compute, but less effective. We present a novel approach using the Bézier convex hull of the parametric tangent plane. It is much more accurate, and by operating in clip space we are able to reduce the computational cost significantly. As our algorithm vectorizes well, we observe comparable test times with increased cull-rates.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Patch-Based Occlusion Culling for Hardware Tessellation

We present an occlusion culling algorithm that leverages the unique characteristics of patch primitives within the hardware tessellation pipeline. That is, unseen patches are costly to compute, but easy to find screen space bounds for. Our algorithm uses the well known hierarchical Z-buffer approach, but we present a novel variant that uses temporal coherence to maintain lists of visible and oc...

متن کامل

Rendering Subdivision Surfaces using Hardware Tessellation

Computer-generated images are an essential part of today's life where an increasing demand for richer images requires more and more visual detail. e quality of resulting images is strongly dependent on the representation of the underlying surface geometry. is is particularly important in the movie industry where subdivision surfaces have evolved into an industry standard. While subdivision su...

متن کامل

Efficient bounding of displaced Bézier patches

In this paper, we present a new approach to conservative bounding of displaced Bézier patches. These surfaces are expected to be a common use case for tessellation in interactive and real-time rendering. Our algorithm combines efficient normal bounding techniques, min-max mipmap hierarchies and oriented bounding boxes. This results in substantially faster convergence for the bounding volumes of...

متن کامل

Hierarchical Visibility Culling for Spline Models

We present hierarchical algorithms for visibility culling of spline models This includes back patch culling a generalization of back face culling for poly gons to splines These algorithms are extended to trimmed surfaces as well We propose di erent spa tial approximations for enclosing the normals of a spline surface and compare them for e ciency and e ectiveness on di erent graphics systems We...

متن کامل

Visibility Culling per Cache Block with Tiling-Traversal Algorithm

As many applications in computer graphics require render high complex 3D scenes at interactive rates, the search for an effective visibility culling method has become one of the most important issues to be addressed in the design of 3D rendering processors. In this paper, we proposed a new rasterization pipeline with visibility culling; the proposed architecture performs the visibility culling ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011